翻訳と辞書 |
Averaging argument : ウィキペディア英語版 | Averaging argument In computational complexity theory and cryptography, averaging argument is a standard argument for proving theorems. It usually allows us to convert probabilistic polynomial-time algorithms into non-uniform polynomial-size circuits. == Example == To simplify, let's first consider an example. Example: If every person likes at least 1/3 of the books in a library, then, there exists a book, which at least 1/3 of people liked it. Proof: Suppose there are people and B books. Each person likes at least of the books. Let people leave a mark on the book they like. Then, there will be at least marks. The averaging argument claims that there exists a book with at least marks on it. Assume, to the contradiction, that no such book exists. Then, every book has fewer than marks. However, since there are books, the total number of marks will be fewer than , contradicting the fact that there are at least marks.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Averaging argument」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|